Negation functions based semantics for ordered linguistic labels
نویسنده
چکیده
After arguing that in the knowledge acquisition framework experts can not always supply a precise semantics for the linguistic labels they use, we show that negation functions over an ordered set of linguistics labels induce a semantics. We study the semantics induced by classical negation, functions from L to L, and also the one induced by negation functions from L to parts of L.
منابع مشابه
Proof-Theoretic Treatment of Various Negations Based on Natural Deduction
The differences and relations of various negations have attracted interest in logical investigation, and most of the studies have utilized a model-theoretic approach (cf. Dunn 1999, Shramko 2005, Ripley 2009). This study will propose a general framework to treat various negations from the perspective of proof-theoretic semantics (PTS) based on natural deduction. It is well known that when we de...
متن کاملExtraction of Drug-Drug Interaction from Literature through Detecting Linguistic-based Negation and Clause Dependency
Extracting biomedical relations such as drug-drug interaction (DDI) from text is an important task in biomedical NLP. Due to the large number of complex sentences in biomedical literature, researchers have employed some sentence simplification techniques to improve the performance of the relation extraction methods. However, due to difficulty of the task, there is no noteworthy improvement in t...
متن کاملOrder and Negation as Failure
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a convenient formulation of certain problems, which is illustrated by means of an intuitive simulation of logic programming with ordered disjunction. The simulation also supports a broader application of “ordered disjunction”...
متن کاملWell-Founded Ordered Search: Goal-Directed Bottom-Up Evaluation of Well-Founded Models
There have been several evaluation mechanisms proposed for computing query answers based on the well-founded semantics, for programs with negation. However, these techniques are costly; in particular, for the special case of modularly stratiied programs, Ordered Search is more eecient than the general purpose techniques. However, Ordered Search is applicable only to modularly stratiied programs...
متن کاملHandling Qualitative Preferences Using Normal Form Functions
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented. This logic adds to classical propositional logic a new connective, called ordered disjunction symbolized by ×. That new connective is used to express preferences between alternatives. QCL was not designed to handle c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Intell. Syst.
دوره 11 شماره
صفحات -
تاریخ انتشار 1996